CTL Model Checking for SPIN
نویسندگان
چکیده
We describe an e cient CTL model checking algorithm based on alternating automata and games. A CTL formula, expressing a correctness property, is rst translated to a hesitant alternating automaton and then composed with a Kripke structure representing the model to be checked, this resulting automaton is then checked for nonemptiness. We introduce the nonemptiness game that checks the nonemptiness of a hesitant alternating automata (HAA). In the same way that alternating automata generalises nondeterministic automata, we show that this game for checking the nonemptiness of HAA, generalises the nested depthrst algorithm used to check the nonemptiness of nondeterministic B uchi automata (used in SPIN).
منابع مشابه
Program Sketching via CTL* Model Checking
Sketching is an approach to automated software synthesis where the programmer develops a partial implementation called a sketch and a separate specification of the desired functionality. A synthesizer tool then automatically completes the sketch to a complete program that satisfies the specification. Previously, sketching has been applied to finite programs with a desired functional input/outpu...
متن کاملTechniques for Temporal Logic Model Checking
Model checking is a set of formal verification techniques that aim to show that a structure representing a computational system (for instance, a protocol, or a hardware or a software component, among others) is a model for a property that represents a requirement for this system. Many model-checking approaches have been proposed, depending on the formalism the property is expressed in, and the ...
متن کاملCTL Property Language in Formal Verification of Systems A System Approach
We use symbolic model checking to verify a VHDL design. This paper mainly focuses on Computational Tree Logic (CTL) for model checking problem. We have explained these two terms “CTL” and “model checking” for providing a clear idea about these two. Most importantly we have explored the ways of uses of CTL formulae in the case of model checking. The importance of the model checking, the ways of ...
متن کاملModel Checking on Product Structures
We present an algorithm for checking CTL formulas in Kripke structures with side conditions, where the side conditions define new variables in terms of path formulas. Given any CTL formula where the defined variables may occur, the presented algorithm will determine the set of states where the CTL∗ formula holds that is obtained by replacing each new variable defined by a side condition by its ...
متن کاملReducing CTL-live Model Checking to Semantic Entailment in First-Order Logic (Version 1)
The core of temporal logic model checking is the reachability problem, which is not expressible in first-order logic (FOL). Most model checking algorithms, both for finite and infinite Kripke structures, contain a loop that iterates to reach a fixed-point. As a result, reasoners with input languages no more expressive than FOL have been used iteratively for model checking rather than having the...
متن کامل